On the Passage Time Geometry of the Last Passage Percolation Problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Last Branching in Directed Last Passage Percolation

The 1+1 dimensional directed polymers in a Poissonean random environment is studied. For two polymers of maximal length with the same origin and distinct end points we establish that the point of last branching is governed by the exponent for the transversal fluctuations of a single polymer. We also investigate the density of branches.

متن کامل

The Last Passage Problem on Graphs

We consider a brownian motion on a general graph, that starts at time t = 0 from some vertex O and stops at time t somewhere on the graph. Denoting by g the last time when O is reached, we establish a simple expression for the Laplace Transform, L, of the probability density of g. We discuss this result for some special graphs like star, ring, tree or square lattice. Finally, we show that L can...

متن کامل

On the local fluctuations of last-passage percolation models

Using the fact that the Airy process describes the limiting fluctuations of the Hammersley last-passage percolation model, we prove that it behaves locally like a Brownian motion. Our method is quite straightforward, and it is based on a certain monotonicity and good control over the equilibrium measures of the Hammersley model (local comparison).

متن کامل

Limiting distribution of last passage percolation models

We survey some results and applications of last percolation models of which the limiting distribution can be evaluated.

متن کامل

Last Passage Percolation and Traveling Fronts

We consider a system of N particles with a stochastic dynamics introduced by Brunet and Derrida [7]. The particles can be interpreted as last passage times in directed percolation on {1, . . . , N} of mean-field type. The particles remain grouped and move like a traveling front, subject to discretization and driven by a random noise. As N increases, we obtain estimates for the speed of the fron...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ALEA-Latin American Journal of Probability and Mathematical Statistics

سال: 2021

ISSN: ['1980-0436']

DOI: https://doi.org/10.30757/alea.v18-10